Minimum Distance of Binary Nonlinear Codes∗
نویسندگان
چکیده
A binary nonlinear code can be represented as the union of cosets of a binary linear subcode. Using this representation, new algorithms methods to compute the minimum Hamming weight and distance are presented. The performance of these algorithms is also studied.
منابع مشابه
A new series of Z4-linear codes of high minimum Lee distance derived from the Kerdock codes
A new series of Z4-linear codes of high minimum Lee distance is given. It is derived from the Z4-linear representation of the Kerdock codes. The Gray image of the smallest of these codes is a nonlinear binary (114, 2, 56)-code, and in the second smallest case the Gray image is a nonlinear binary (1988, 2, 992)-code. Both codes have at least twice as many codewords as any linear binary code of e...
متن کاملEfficient representation of binary nonlinear codes: constructions and minimum distance computation
A binary nonlinear code can be represented as a union of cosets of a binary linear subcode. In this paper, the complexity of some algorithms to obtain this representation is analyzed. Moreover, some properties and constructions of new codes from given ones in terms of this representation are described. Algorithms to compute the minimum distance of binary nonlinear codes, based on known algorith...
متن کاملA deterministic algorithm for the distance and weight distribution of binary nonlinear codes
Given a binary nonlinear code, we provide a deterministic algorithm to compute its weight and distance distribution, and in particular its minimum weight and its minimum distance, which takes advantage of fast Fourier techniques. This algorithm’s performance is similar to that of best-known algorithms for the average case, while it is especially efficient for codes with low information rate. We...
متن کاملWeak Flip Codes and its Optimality on the Binary Erasure Channel
Based on a new way of designing codes using codebook columns, a family of nonlinear codes, called weak flip codes, is presented and shown to contain many beautiful properties. In particular the subfamily fair weak flip codes, which goes back to definitions by Berlekamp, Gallager, and Shannon and which was shown to achieve the error exponent with a fixed number of codewords M, can be seen as a g...
متن کاملA classification of binary systematic codes of small defect
In this paper non-trivial non-linear binary systematic AMDS codes are classified in terms of their weight distributions, employing only elementary techniques. In particular, we show that their length and minimum distance completely determine the weight distribution.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012